An iterative algorithm to compute the Bott-Duffin inverse and generalized Bott-Duffin inverse
نویسندگان
چکیده
منابع مشابه
Condition number of Bott-Duffin inverse and their condition numbers
Various normwise relative condition numbers that measure the sensitivity of Bott– Duffin inverse and the solution of constrained linear systems are characterized. The sensitivity of condition number itself is then investigated. Finally, upper bounds are derived for the sensitivity of componentwise condition numbers. 2002 Elsevier Science Inc. All rights reserved.
متن کاملFurther Results on Generalized Bott–duffin Inverses
Let A be a bounded linear operator, PM be an orthogonal projection with range M and PM ,N be an idempotent with range M and kernel N . This paper presents some novel relations between Bott-Duffin inverse AM = PM (APM + PM⊥) + and generalized Bott-Duffin inverse AM ,N = PM ,N (APM ,N + PN ,M ) + . Furthermore, the representations for the BottDuffin inverse and generalized Bott-Duffin inverse are...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Iterative Algorithm to Compute the Generalized Inverse A(2) T,S Under the Restricted Inner Product
Let T and S be a subspace of C and C, respectively. Then for A ∈ Cm×n satisfied AT ⊕ S = C, the generalized inverse A T,S is given by A (2) T,S = (PS⊥APT ) †. In this paper, a finite formulae is presented to compute generalized inverse A T,S under the concept of restricted inner product, which defined as < A,B >T,S=< PS⊥APT , B > for the A,B ∈ Cm×n. By this iterative method, when taken the init...
متن کاملAn Optimal Algorithm to Compute the Inverse Beacon Attraction Region
The beacon model is a recent paradigm for guiding the trajectory of messages or small robotic agents in complex environments. A beacon is a fixed point with an attraction pull that can move points within a given polygon. Points move greedily towards a beacon: if unobstructed, they move along a straight line to the beacon, and otherwise they slide on the edges of the polygon. The Euclidean dista...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2012
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1204769s